QUASI MULTIPLICATION AND -GROUPS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Galois Groups and Complex Multiplication

The Schur problem for rational functions is linked to the theory of complex multiplication and thereby solved. These considerations are viewed as a special case of a general problem, prosaically labeled the extension of constants problem. The relation between this paper and a letter of J. Herbrand to E. Noether (published posthumously) is speculatively summarized in a conjecture that may be reg...

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...

متن کامل

A note on quasi irresolute topological groups

In this study, we investigate the further properties of quasi irresolute topological groups defined in [20]. We show that if a group homomorphism f between quasi irresolute topological groups is irresolute at $e_G$, then $f$ is irresolute on $G$. Later we prove that in a semi-connected quasi irresolute topological group $(G,*,tau )$, if $V$ is any symmetric semi-open neighborhood of $e_G$, then...

متن کامل

Closest Multiplication Tables of Groups

Suppose that all groups of order n are defined on the same set G of cardinality n, and let the distance of two groups of order n be the number of pairs (a, b) ∈ G×G where the two group operations differ. Given a group G(◦) of order n, we find all groups of order n, up to isomorphism, that are closest to G(◦).

متن کامل

Multiplication groups and inner mapping groups of Cayley–Dickson loops

The Cayley–Dickson loop Qn is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley–Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers, quaternions, octonions, sedenions). We establish that the inner mapping group Inn(Qn) is an elementary abelian 2-group of order 2 −2 and describe the multiplicati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 2013

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788712000584